Ant Colony Behaviour as Routing Mechanism to Provide Quality of Service
نویسندگان
چکیده
Quality of Service (QoS) guarantees must be supported in a network that intends to carry real-time and multimedia traffic effectively. The effort of satisfying the QoS different requirements of these applications has resulted in the proposals of several QoS-based frameworks, such as Integrated Services (IntServ) [1], Differentiated Services (DiffServ) [2], and Multi-Protocol Label Switching (MPLS) [6]. The support of QoS services is underpinned by QoS Routing (QoSR), known as the task of determining paths that satisfy QoS constraints [4]. There exist many QoSR algorithms and also some first applications of ant-inspired algorithms. In this paper, we propose a QoSR scheme called AntNet-QoS. Taking inspiration from Ant Colony Optimization (ACO) ideas, and in particular from the AntNet routing algorithm [5] (which was designed for best-effort IP networks), AntNet-QoS is able to provide routes under QoS constraints in a DiffServ network, as well as under traditional hopby-hop IP routing conditions. In the DiffServ model [2], QoS conditions to be satisfied are specified in Service Level Agreements (SLA) [7]. The SLA specify what Classes of Traffic (CoT) will be provided, what guarantees are needed for each class, and how much data will be sent for each class. Using the DiffServ model a variety of CoT can be defined based upon the DiffServ Code Point (DSCP) field. DiffServ allows for a maximum of 14 different CoT. In AntNet-QoS, we will consider four of these: an Expedited Forwarding (EF) class to transport real-time traffic, two Assured Forwarding (AF1 and AF2) classes for traffic with different flavors for losses, and, as usual, a Best Effort (BE) class for traffic with no QoS requirements. In the rest of this paper, we describe the general characteristics of the algorithm and briefly discuss our future plans for implementation and testing.
منابع مشابه
Improvement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملImprovement of Routing Operation Based on Learning with Using Smart Local and Global Agents and with the Help of the Ant Colony Algorithm
Routing in computer networks has played a special role in recent years. The cause of this is the role of routing in a performance of the networks. The quality of service and security is one of the most important challenges in routing due to lack of reliable methods. Routers use routing algorithms to find the best route to a particular destination. When talking about the best path, we consider p...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملA Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملWeighted Clustering Algorithm with Ant Colony Optimization to Provide Better Quality of Service
The rapidly changing topology of Mobile Ad hoc networks (MANETs) poses various challenges like routing, Quality of Service (QoS) etc. This paper attempts to compare performance parameters like throughput, packet delivery fraction and packet loss using Ad hoc On-Demand Distance Vector(AODV) routing protocol and Ant Colony Optimization(ACO). The proposed method combines Weighted Clustering Algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004